Induction for termination with local strategies
Identifieur interne : 008F88 ( Main/Exploration ); précédent : 008F87; suivant : 008F89Induction for termination with local strategies
Auteurs : Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerSource :
- Electronic Notes in Theoretical Computer Science ; 2001.
English descriptors
- KwdEn :
Abstract
In this paper, we propose a method for specifically proving termination of rewriting with particular strategies : local strategies on operators. An inductive proof procedure is proposed, based on an explicit induction on the termination property. Given a term, the proof principle relies on alternatively applying the induction hypothesis on its subterms, by abstracting the subterms with induction variables, and narrowing the obtained terms in one step, according to the strategy. The induction relation, an F-stable ordering having the subterm property, is not given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002F03
- to stream Crin, to step Curation: 002F03
- to stream Crin, to step Checkpoint: 001604
- to stream Main, to step Merge: 009509
- to stream Main, to step Curation: 008F88
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="343">Induction for termination with local strategies</title></titleStmt><publicationStmt><idno type="RBID">CRIN:fissore01a</idno><date when="2001" year="2001">2001</date><idno type="wicri:Area/Crin/Corpus">002F03</idno><idno type="wicri:Area/Crin/Curation">002F03</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002F03</idno><idno type="wicri:Area/Crin/Checkpoint">001604</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001604</idno><idno type="wicri:Area/Main/Merge">009509</idno><idno type="wicri:Area/Main/Curation">008F88</idno><idno type="wicri:Area/Main/Exploration">008F88</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Induction for termination with local strategies</title><author><name sortKey="Fissore, Olivier" sort="Fissore, Olivier" uniqKey="Fissore O" first="Olivier" last="Fissore">Olivier Fissore</name></author><author><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name></author><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name></author></analytic><series><title level="j">Electronic Notes in Theoretical Computer Science</title><imprint><date when="2001" type="published">2001</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>induction</term><term>local strategy on operators</term><term>narrowing</term><term>ordering constraints</term><term>rewriting</term><term>rule-based languages</term><term>termination</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2899">In this paper, we propose a method for specifically proving termination of rewriting with particular strategies : local strategies on operators. An inductive proof procedure is proposed, based on an explicit induction on the termination property. Given a term, the proof principle relies on alternatively applying the induction hypothesis on its subterms, by abstracting the subterms with induction variables, and narrowing the obtained terms in one step, according to the strategy. The induction relation, an F-stable ordering having the subterm property, is not given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Fissore, Olivier" sort="Fissore, Olivier" uniqKey="Fissore O" first="Olivier" last="Fissore">Olivier Fissore</name><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 008F88 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 008F88 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:fissore01a
|texte= Induction for termination with local strategies
}}
| This area was generated with Dilib version V0.6.33. |  |